Clique cover - PDFSEARCH.IO - Document Search Engine

Clique cover
Results: 36

#	Item
21	Constant Thresholds Can Make Target Set Selection Tractable? Morgan Chopin1?? , Andr´e Nichterlein2 , Rolf Niedermeier2 , and Mathias Weller2? ? ? 1 Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2012-09-21 09:31:02 Graph operations Path decomposition Clique Kernelization Vertex cover Parameterized complexity Tree decomposition Feedback vertex set Dominating set Graph theory Theoretical computer science NP-complete problems
22	The Parameterized Complexity of the Rainbow Subgraph Problem Falk Hüffner? , Christian Komusiewicz?? , Rolf Niedermeier, and Martin Rötzschke Institut für Softwaretechnik und Theoretische Informatik, TU Berlin, German Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-07-31 12:35:33 NP-complete problems Graph coloring Degeneracy Vertex cover Edge coloring Clique Vertex Graph Dense subgraph Graph theory Theoretical computer science Mathematics
23	Theory of Computing Systems manuscript No. (will be inserted by the editor) Constant Thresholds Can Make Target Set Selection Tractable Morgan Chopin∗ · Andr´ Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-09-10 04:14:52 Graph operations Path decomposition Vertex cover Feedback vertex set Clique Kernelization Dominating set Tree decomposition Vertex Graph theory Theoretical computer science NP-complete problems
24	New Races in Parameterized Algorithmics Christian Komusiewicz and Rolf Niedermeier Institut f¨ ur Softwaretechnik und Theoretische Informatik, TU Berlin, Germany {christian.komusiewicz,rolf.niedermeier}@tu-berlin.de Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2012-08-07 06:26:48 NP-complete problems Parameterized complexity Kernelization Path decomposition Vertex cover Feedback vertex set Dominating set Tree decomposition Clique Graph theory Theoretical computer science Mathematics
25	k Newsletter of the Parameterized Complexity Community fpt.wikidot.com www.fpt.wikidot.com Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2014-10-14 03:31:39 Complexity classes NP-complete problems Analysis of algorithms Parameterized complexity Michael Fellows Kernelization Clique problem Vertex cover Path decomposition Theoretical computer science Computational complexity theory Applied mathematics
26	IEEE/ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, VOL. XX, NO. X, JANUARY 201X 1 Partitioning Biological Networks into Highly Connected Clusters Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-01-08 11:56:00 NP-complete problems Degeneracy Vertex cover Kernelization Neighbourhood Clique Graph operations Connectivity Tree Graph theory Mathematics Theoretical computer science
27	A Continuous Characterization of Maximal Cliques in k-uniform Hypergraphs Samuel Rota Bul`o, and Marcello Pelillo Dipartimento di Informatica. Universit` a Ca’ Foscari di Venezia. Add to Reading List Source URL: www.dsi.unive.it Language: English - Date: 2010-08-27 12:03:59 Graph operations Clique problem Clique Extremal graph theory Hypergraph Vertex cover Line graph Clique-sum Graph theory Theoretical computer science NP-complete problems
28	SIAM J. Comput-98 DISPROVING THE SINGLE LEVEL CONJECTURE ∗ Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2013-04-06 16:29:26 NP-complete problems Clique Matching Vertex cover Tree Circuit Aanderaa–Karp–Rosenberg conjecture Path decomposition Graph theory Theoretical computer science Mathematics
29	Newsletter of the PC Community November 2011 Welcome Frances Rosamond, Editor Congratulations to Serge Gaspers and Mohammad Taghi Hajiaghayi for multiple awards, to Yoichi Iwata for the IPEC Excellent Student Paper award Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 05:09:27 NP-complete problems Parameterized complexity Kernelization NP-complete Bidimensionality Dominating set Clique problem Feedback vertex set Vertex cover Theoretical computer science Computational complexity theory Applied mathematics
30	Local Search: Is Brute-Force Avoidable? Add to Reading List Source URL: ijcai.org Language: English - Date: 2009-06-22 08:17:00 Planar graphs NP-complete problems Tree decomposition Minor Apex graph Graph Clique-sum Neighbourhood Vertex cover Graph theory Theoretical computer science Graph operations